Bandwidth and pebblingROSENBERG, A. L; SUDBOROUGH, I. H.Computing (Wien. Print). 1983, Vol 31, Num 2, pp 115-139, issn 0010-485XArticle

SUPERCONCENTRATORS OF DEPTH 2PIPPENGER N.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 1; PP. 82-90; BIBL. 5 REF.Article

PEBBLING AND BANDWITHSUDBOROUGH IH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 373-383; BIBL. 16 REF.Conference Paper

ADVANCES IN PEBBLINGPIPPENGER N.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 407-417; BIBL. 23 REF.Conference Paper

EXTREME TIME-SPACE TRADEOFFS FOR GRAPHS WITH SMALL SPACE REQUIREMENTSCARLSON DA; SAVAGE JE.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 5; PP. 223-227; BIBL. 15 REF.Article

IMPROVED BOUNDS ON THE PROBLEM OF TIME-SPACE TRADE-OFF IN THE PEBBLE GAMEREISCHUK R.1980; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1980; VOL. 27; NO 4; PP. 839-849; BIBL. 7 REF.Article

A COMPARISON OF TWO VARIATIONS OF A PEBBLE GAME ON GRAPHSMEYER AUF DER HEIDE F.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 13; NO 3; PP. 315-322; BIBL. 8 REF.Article

BLACK-WHITE PEBBLES AND GRAPH SEPARATIONLENGAUER T.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 16; NO 4; PP. 465-475; BIBL. 15 REF.Article

I/O COMPLEXITY: THE RED-BLUE PEBBLE GAMEHONG JW; KUNG HT.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 326-333; BIBL. 10 REF.Conference Paper

CLASSES OF PEBBLE GAMES AND COMPLETE PROBLEMSKASAI T; ADACHI K; IWATA S et al.1979; S. I. A. M. J. COMPUTG; USA; DA. 1979; VOL. 8; NO 4; PP. 574-586; BIBL. 13 REF.Article

SOME CONNECTIONS BETWEEN ITERATIVE PROGRAMS, RECURSIVE PROGRAMS, AND FIRST-ORDER LOGICKFOURY AJ.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 150-166; BIBL. 5 REF.Conference Paper

THE PEBBLING PROBLEM IS COMPLETE IN POLYNOMIAL SPACEGILBERT JR; LENGAUER T; TARJAN RE et al.1980; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1980; VOL. 9; NO 3; PP. 513-524; BIBL. 15 REF.Article

PEBBLE GAMES FOR STUDYING STORAGE SHARINGRAVI SETHI.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 1; PP. 69-84; BIBL. 20 REF.Article

TABULATION TECHNIQUES FOR RECURSIVE PROGRAMSBIRD RS.1980; ACM COMPUT. SURV.; ISSN 0360-0300; USA; DA. 1980; VOL. 12; NO 4; PP. 403-417; BIBL. 26 REF.Article

AN ASYMPTOTICALLY OPTIMAL ALGORITHM FOR THE DUTCH NATIONAL FLAG PROBLEMBITNER JR.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 2; PP. 243-262; BIBL. 4 REF.Article

TWO FAMILIAR TRANSITIVE CLOSURE ALGORITHMS WHICH ADMIT NO POLYNOMIAL TIME, SUBLINEAR SPACE IMPLEMENTATIONSTOMPA M.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 1; PP. 130-137; BIBL. 27 REF.Article

ASYMPTOTICALLY TIGHT BOUNDS ON TIME-SPACE TRADE-OFFS IN A PEBBLE GAMELENGAUER T; TARJAN RE.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 4; PP. 1087-1130; BIBL. 34 REF.Article

A MODEL OF CONCURRENT DATABASE TRANSACTIONSSETHI R.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 175-184; BIBL. 15 REF.Conference Paper

GRAPH PEBBLING WITH MANY FREE PEBBLES CAN BE DIFFICULTCARLSON DA; SAVAGE JE.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 326-332; BIBL. 13 REF.Conference Paper

TIME-SPACE TRADE-OFFS FOR GENERAL RECURSIONVERBEEK R.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 228-234; BIBL. 12 REF.Conference Paper

UPPER AND LOWER BOUNDS FOR FIRST ORDER EXPRESSIBILITYIMMERMAN N.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 25; NO 1; PP. 76-98; BIBL. 22 REF.Article

UNBOUNDED PROGRAM MEMORY ADDS TO THE EXPRESSIVE POWER OF FIRST-ORDER DYNAMIC LOGICTIURYN J.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 335-339; BIBL. 12 REF.Conference Paper

COMPARATIVE SCHEMATOLOGY AND PEBBLING WITH AUXILIARY PUSHDOWNSPIPPENGER N.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 351-356; BIBL. 9 REF.Conference Paper